Research of VRP Model with Semi-soft Time Window Constraints
نویسندگان
چکیده
Vehicle routing problem is a kind of common problem in logistics distribution center, in order to solve the high delivery cost of VRP and time constraint problem, the VRP model with the object level and constraints by semi-soft time window is built. Aiming to the semi-soft time window constraints the optimization of the model is discussed. Finally the numerical examples prove the superiority of the semi-soft time window constraints than other types of time window.
منابع مشابه
A multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to minimize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogeneous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation aff...
متن کاملIn the City of New York Office of Projects and Grants
A. Determined the exact structure of the asymptotic optimal solution value of the VRP with capacity and time window constraints and used it to develop a new and efficient algorithm. In Bramel and Simchi-Levi (1996) we have characterized the asymptotic optimal cost of the VRP with Capacity and Time Window constraints. This characterization enabled us to understand the algorithmic structure requi...
متن کامل